Adaptive Rekeying for Secure Multicast∗
نویسندگان
چکیده
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is complete. This interruption is especially necessary if the rekeying is done because a user has left (or is removed). We split the rekeying cost into two parts: the cost of the critical path —where each user receives the new group key, and the cost of the non-critical path —where each user receives any other keys that it needs to obtain. We present a family of algorithms that show the tradeoff between the cost of the critical path and the cost of the noncritical path. Our solutions allow the group controller to choose the appropriate algorithm for key distribution by considering the requirements on critical and non-critical cost. In our solutions, the group controller can dynamically change the algorithm for key distribution to adapt to changing application requirements. Moreover, we argue that our solutions allow the group controller to effectively manage heterogeneous groups where users have different requirements/capabilities. key words: Group Communication, Secure Multicast, Critical Path, Adaptive Rekeying
منابع مشابه
An Adaptive Hybrid Rekeying Protocol for Dynamic Multicast Groups
In secure multi-party communications, the Logical Key Hierarchy scheme has been proved to be communication optimal for large groups. However, this scheme still suffers from an expensive rekeying cost when the group is very dynamic. To reduce the rekeying cost, Zhu et al. suggested to partition the logical key tree in two sub-trees based on the duration of each member in the multicast group. Alt...
متن کاملTowards scalable key management for secure multicast communication
Secure multicast communication allows a sender to deliver encrypted messages to a group of authorized receivers. A practical approach is that the sender uses a common key shared by the authorized receivers to encrypt the transmitted messages. The common key must be renewed to ensure forward/backward secrecy when group members leave/join the group, called the rekeying process. Thus, the rekeying...
متن کاملSecure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network
In mobile multihop relay (MMR) networks, Relay multicast rekeying algorithm (RMRA) is meant to ensure secure multicast communication and selective updating of keys in MMR networks. However, in RMRA, the rekeying is carried out after a specific interval of time, which cannot ensure the security for multicast communication on joining the member. Secondly, the rekeying scheme generates a huge comm...
متن کاملRekeying and Storage Cost for Multiple User Revocation
In this paper, we focus on tradeoffs between storage cost and rekeying cost for secure multicast. Specifically, we present a family of algorithms that provide a tradeoff between the number of keys maintained by users and the time required for rekeying due to revocation of multiple users. We show that some well known algorithms in the literature are members of this family. We show that algorithm...
متن کاملBatch Rekeying in Mykil Key Management System
This paper describes support for batch rekeying in Mykil, a key management system for supporting secure group multicast. Batch rekeying in Mykil allows for substantial reductions in the cost and complexity of rekeying operations, arguably the expensive portion of the system. By accumulating join and leave operations and utilizing an algorithmic approach to minimize the number of necessary rekey...
متن کامل